VISUAL STUDENTS SKILL IN DRAWING TWO DIMENSIONAL IMAGINATIF
نویسندگان
چکیده
منابع مشابه
Drawing and Encoding Two-Dimensional Posets
In this pa per we deal with coding and drawing partial orders in a most economical way. Dimension theory provides us with the framework for this. In the restricted class of partial orders of dimension two, we define compacting rules on grids and give a linear time algorithm to find a minimal surface drawing of an order. We also provide an O(lP/*) time algorithm that computes the minimal square ...
متن کاملDrawing of Two-Dimensional Irregular Meshes
We present a method for transforming two-dimensional irregular meshes into square meshes with only a constant blow up in area. We also explore context invariant transformations of irregular meshes into square meshes and provide a lower bound for the transformation of down-staircases.
متن کاملA New Framework in Interpreting Two-Dimensional Line Drawing
This paper proposes a new framework to interpret a two-dimensional line drawing that represents a threedimensional object. The framework synthesizes three algorithms namely thinning algorithms, chain code algorithm based on Freeman Chain Code (FCC), and a new corner detection algorithms that accept chain code series as its input. Linear system of two image regularities namely spatial structure ...
متن کاملTwo-Dimensional Visual Language Grammar
Visual language refers to the idea that communication occurs through visual symbols, as opposed to verbal symbols or words. Contrast to a sentence construction in spoken language with a linear ordering of words, a visual language has a simultaneous structure with a parallel temporal and spatial configuration. Inspired by Deikto [5], we propose a two-dimensional string or sentence construction o...
متن کاملTwo Algorithms for Three Dimensional Orthogonal Graph Drawing
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. Our first algorithm gives drawings bounded by an O(x/~ ) • O(x/~ • O(v~ ) box; each edge route contains at most 7 bends. The best previous result generated edge routes containing up to 16 bends per route. Our second al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AL-ISHLAH: Jurnal Pendidikan
سال: 2020
ISSN: 2597-940X,2087-9490
DOI: 10.35445/alishlah.v12i2.216